MIME-Version: 1.0
Server: CERN/3.0
Date: Tuesday, 07-Jan-97 15:47:34 GMT
Content-Type: text/html
Content-Length: 5068
Last-Modified: Monday, 27-Mar-95 15:02:06 GMT


<title>Notes On UNITY</title>

The following is a list of the notes on UNITY that are available
electronically, all are in compressed (conforming) Postscript.
These files are for non commercial redistribution only. They may not be
altered in any form without permission from the authors.<p>

Mail comments or questions to psp-request@cs.utexas.edu 

<ol> 
<li> <a
href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/01-88.ps.Z"> General
Conjunction and Disjunction Rules for <em> unless</em></a> J. Misra   9/14/88

<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/02-88.ps.Z">   A Theorem About Dynamic Acyclic Graphs</a>   J. Misra   9/13/88
<li> <a
href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/03-88.ps.Z">   A
Composition Theorem About Fixed Points</a>    J. Misra   9/14/88
<li> <a
href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/04-88.ps.Z">   A
Theorem Relating <em> leads-to</em> and <em> unless</em></a>   J. Misra   12/20/88 
<li> <a
href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/05-89.ps.Z">
Progress--Safety--Safety</a>   J. Misra   4/20/89 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/06-89.ps.Z">   <em> Leads-to</em> and program union</a>   A. Singh   6/20/89
<li> <a
href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/07-89.ps.Z"> On
Strengthening the Guard</a>   A. Singh   6/20/89 
<li> <a
href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/08-89.ps.Z">
Functions Preserved by <em> unless</em>/<em> leads-to</em></a>   J. Misra   6/16/89

<li> <a
href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/09-89.ps.Z">
Proving <em> unless</em> Properties by Parts</a>   J. Misra   6/19/89 
<li> <a
href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/10-89.ps.Z">
Monotonicity, Stability and Constants</a>   J. Misra   12/16/89

<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/11-90.ps.Z">
The Importance of Ensuring</a>    J. Misra   1/11/90
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/12-90.ps.Z">   Phase Synchronization</a>   J. Misra   1/31/90
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/13-90.ps.Z">   A Family of 2-process Mutual Exclusion Algorithms</a>   J. Misra   2/8/90
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/14-90.ps.Z">
Soundness of the Substitution Axiom</a>    J. Misra   3/2/90
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/15-90.ps.Z">
Auxiliary Variables</a>   J. Misra   7/10/90 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/16-90.ps.Z">
Proving Progress For Program Sequencing</a>   J. Misra   7/10/90 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/17-90.ps.Z">
Preserving Progress Under Program Composition</a>   J. Misra   7/17/90 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/18-90.ps.Z">
A Specialization of <em> detects</em></a>   J. Misra   7/17/90 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/19-90.ps.Z">
More on Strengthening the Guard</a>   J. Misra   7/17/90 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/20-90.ps.Z">  Examples of Program Construction Using UNITY</a>   E. Knapp   10/29/90
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/21-90.ps.Z">   Stable Conjunction</a>   J. Misra   10/31/90
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/22-90.ps.Z">   A
Correction on Note 13</a>   A. Dappert-Farquhar   12/90 
<li>   Three Definitions of <em> leads-to</em> for UNITY   J. Pachl   12/3/90 (This note is currently unavailable)
<li>   On a Notion of Completeness for the <em> Leads-to</em>   J.R. Rao   7/15/91 (This note is currently unavailable)
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/25-90.ps.Z">
Completion Theorem Revisited</a>   J. Misra   7/26/91 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/26-90.ps.Z">
Using Prefix Computation to Add</a>   J . Misra   8/8/91
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/27-91.ps.Z">
Methodological Hints About Constructing <em> unless</em> Properties</a>   J.
Misra   12/19/91 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/28-91.ps.Z">   A Program-Composition Theorem Involving Fixed-Point</a>   J. Misra   12/19/91 (This Note Subsumes Note 03.)
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/29-91.ps.Z">  A
Generalization of the Completion Theorem</a>   J. Misra   12/20/91 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/30-91.ps.Z">
More on <em> detects</em> and <em> trails</em></a>   J. Misra   12/20/91 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/31-92.ps.Z">
How to reason with Strong-fairness and No-fairness</a>   J. Misra   7/2/92 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/32-92.ps.Z">
Proof of a Real-Time Mutual-Exclusion Algorithm</a>   John Allen Carruth &
J Misra  9/10/92 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/33-93.ps.Z">
Proving Convergence of a Hopfield Neural Network</a>   M. M. Muller 
<li> <a href="ftp://ftp.cs.utexas.edu/pub/psp/unity/notes/deriv.ps.Z">  Examples of Program Construction using UNITY</a>   E. Knapp (unnumbered)
</ol>
